Strengthened 0-1 linear formulation for the daily satellite mission planning
نویسنده
چکیده
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explanation is based on stable set polytope formulations for perfect graphs. keywords: Integer programming, stable set polytope, satellite mission planning, cocomparability graph.
منابع مشابه
An extensive comparison of 0-1 linear programs for the daily satellite mission planning
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. Several heuristics have already been used to solve this difficult combinatorial problem. In order to assess the quality of the obtained approximate solutions, some 0-1 linear formulations have been proposed. Indeed, optimal solution values of linear relaxations provide upper bounds of the o...
متن کاملOptimization of Single-Satellite Operational Schedules Towards Enhanced Communication Capacity
There are a growing number of small satellites that are being launched and operated to accomplish novel science and technology missions. Scientists and mission operators are seeking to download large quantities of data from these small satellites, however they are resource-constrained and communicate to capacity-constrained ground networks. Motivated by the need for intelligent operational sche...
متن کاملOn the Global Optimum Path Planning for Redundant Space Manipulators
AbsCrocr-Robotic manipulators wiU play a significant role in the maintenance and repair of space stations and satellites, and other f u m space missions. Robot path planning and control for the above applications should be optimum, since any inetedency in the planning may considerably risk the success of the space mission. This paper prrsents a global optimum path planning scheme for redundant ...
متن کاملPlanning Acquisitions for an Ocean Global Surveillance Mission
In this paper, we present the problem of planning the acquisitions performed by a constellation of radar satellites in order to fulfil as well as possible an ocean global surveillance mission. Then, we describe the local search algorithm, inspired by large neighborhood search techniques and knapsack heuristics, that has been specifically designed and implemented to solve daily planning problem ...
متن کاملPlanning for an Ocean Global Surveillance Mission
In this paper, we present the problem of planning the activities of a constellation of radar satellites in order to fulfil as well as possible an ocean global surveillance mission. Then, we describe the two greedy algorithms that have been designed and implemented so far to solve the huge daily problem instances: a chronological algorithm and a non chronological one. We report first experimenta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 11 شماره
صفحات -
تاریخ انتشار 2006